Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
351	Chapter 4: Deterministic Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Linear programming relaxation Approximation algorithm Scheduling Linear programming NP Algorithm Mathematical optimization Applied mathematics Theoretical computer science
352	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:04:13 NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics
353	Chapter 7: The Primal-Dual Method (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-01-18 09:45:26 Combinatorial optimization Linear programming Linear programming relaxation Relaxation Approximation algorithm Duality Mathematical optimization Theoretical computer science Mathematics
354	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
355	Chapter 4: Deterministic Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Operations research Linear programming Combinatorial optimization Linear programming relaxation Relaxation Bin packing problem Approximation algorithm Mathematical optimization Theoretical computer science Applied mathematics
356	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 NP-complete problems Probabilistic complexity theory Mathematical optimization Complexity classes PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
357	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Mathematical optimization Job shop scheduling Operations research Structural complexity theory Metric k-center Algorithm Dominating set NP Theoretical computer science Computational complexity theory Mathematics
358	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 09:39:33 Computational complexity theory NP-complete problems Probabilistic complexity theory PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof NP Clique Theoretical computer science Applied mathematics Mathematics
359	Chapter 8: Cuts and Metrics (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-01-30 08:55:10 Approximation algorithm Computational complexity theory Linear programming relaxation Mathematics Applied mathematics Combinatorial optimization Linear programming Theoretical computer science
360	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:04 Approximation algorithm Computational complexity theory Bin packing problem Summation Theoretical computer science Mathematics Applied mathematics

UPDATE